منابع مشابه
How Easy is Matching 2D Line Models Using Local Search?
Local search is a well established and highly ef fective method for solving complex combinatorial optimiza tion problems Here local search is adapted to solve di cult geometric matching problems Matching is posed as the problem of nding the optimal many to many correspon dence mapping between a line segment model and image line segments Image data is assumed to be fragmented noisy and cluttered...
متن کاملHard Knapsack Problems That Are Easy for Local Search
Chvv atal (1980) describes a class of zero-one knapsack problems provably diicult for branch and bound and dynamic programming algorithms. Chung et al. (1988) identiies a class of integer knapsack problems hard for branch and bound algorithms. We show that for both classes of problems local search provides optimal solutions quickly.
متن کاملPerson Search Made Easy
In this study, we present a method to extensively reduce the number of retrieved images and increase the retrieval performance for the person queries on the broadcast news videos. A multi-modal approach which integrates face and text information is proposed. A state-of-theart face detection algorithm is improved using a skin color based method to eliminate the false alarms. This pruned set is c...
متن کاملLiterature Search Made Easy
M any of us have been faced with this situation: we found a certain field of research intriguing, went to an online archive to search for related papers, and the results were just less than satisfactory: they are too unstructured to obtain a big picture, such as how this field evolves over time, what sub-fields it is composed of. Instead of relying on human instinct for such insights, our proje...
متن کاملHow easy is code equivalence over F q ?
The linear code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. The support splitting algorithm [23] runs in polynomial time for all but a negligible proportion of all linear codes, and solves the latter problem by recovering the isometry when it is just a permutation of the code support. While for a binary alphabet i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90046-3